hidden-edge removal

hidden-edge removal
<edp> ■ Ausblenden verdeckter Kanten n ; Entfernen verdeckter Kanten n

English-german technical dictionary. 2013.

Игры ⚽ Нужна курсовая?

Schlagen Sie auch in anderen Wörterbüchern nach:

  • Hidden surface determination — In 3D computer graphics, hidden surface determination (also known as hidden surface removal (HSR), occlusion culling (OC) or visible surface determination (VSD)) is the process used to determine which surfaces and parts of surfaces are not… …   Wikipedia

  • Hidden node problem — In wireless networking, the hidden node problem occurs when a Node (networking) node is visible from a wireless access point (AP), but not from other nodes communicating with said AP. This leads to difficulties in media access control.… …   Wikipedia

  • Computer representation of surfaces — Surface (computer) redirects here. For the table top computer, see Microsoft Surface. An open surface with u and v flow lines and Z contours shown. In technical applications of 3D computer graphics (CAx) such as computer aided design and computer …   Wikipedia

  • Quantitative Invisibility — In CAD/CAM, Quantitative Invisibility (QI) is the number of solid bodies obscuring a point in space as projected onto a plane (called [vector] hidden line removal used by the Vector format). Often, when a CAD engineer creates a projection of his… …   Wikipedia

  • D-Cubed — Components Developer(s) Siemens PLM Software Initial release 1990 Operating system Windows, Unix, Mac OS X, Linux Type CAD/CAM/C …   Wikipedia

  • Elite (video game) — Elite Cover art for Firebird releases of Elite Developer(s) David Braben and Ian Bell …   Wikipedia

  • Дерево квадрантов — Разбитая с помощью дерева квадрантов плоскость Дерево квадрантов (также квадродерево, 4 дерево, англ. quadtree) дере …   Википедия

  • Visibility (geometry) — Visibility is a mathematical abstraction of the real life notion of visibility.Given a set of obstacles in the Euclidean space, two points in the space are said to be visible to each other, if the line segment that joins them does not intersect… …   Wikipedia

  • Wire-frame model — A wire frame model is a visual presentation of an electronic representation of a three dimensional or physical object used in 3D computer graphics. It is created by specifying each edge of the physical object where two mathematically continuous… …   Wikipedia

  • Weiler-Atherton clipping algorithm — used in computer graphics.It allows clipping of a subject polygon by an arbitrarily shaped clip polygon . It is generally applicable only in 2D. Description The algorithm requires polygons to be clockwise and not reentrant (self intersecting).… …   Wikipedia

  • ATI Rage — The ATI RAGE is a series of graphics chipsets offering GUI 2D acceleration, video acceleration, and 3D acceleration. It is the successor to the Mach series of 2D accelerators.3D RAGE (I)The original 3D RAGE (aka Mach64 GT) chip was based upon a… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”